<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.10"/>
<title>Introduction_to_Algorithms: src/tree_algorithms/binarytreenode/binarytreenode_test.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
  $(window).load(resizeHeight);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { init_search(); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">Introduction_to_Algorithms
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.10 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>File&#160;Members</span></a></li>
    </ul>
  </div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('binarytreenode__test_8h_source.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">binarytreenode_test.h</div>  </div>
</div><!--header-->
<div class="contents">
<a href="binarytreenode__test_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">/*</span></div>
<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment"> * Copyright 2016- huaxz &lt;huaxz1986@163.com&gt;</span></div>
<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment"> * This program is free software: you can redistribute it and/or modify</span></div>
<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment"> * it under the terms of the GNU General Public License as published by</span></div>
<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment"> * the Free Software Foundation, either version 2 of the License, or</span></div>
<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment"> * (at your option) any later version.</span></div>
<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment"> * This program is distributed in the hope that it will be useful,</span></div>
<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div>
<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span></div>
<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment"> * GNU General Public License for more details.</span></div>
<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment"> * You should have received a copy of the GNU General Public License</span></div>
<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment"> * along with this program.  If not, see &lt;http://www.gnu.org/licenses/&gt;.</span></div>
<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="comment"> * Author: huaxz1986@163.com (huaxz)</span></div>
<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="preprocessor">#ifndef BINARYTREENODE_TEST</span></div>
<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="preprocessor">#define BINARYTREENODE_TEST</span></div>
<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="preprocessor">#include&quot;src/google_test/gtest.h&quot;</span></div>
<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="preprocessor">#include&quot;<a class="code" href="binarytreenode_8h.html">binarytreenode.h</a>&quot;</span></div>
<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="keyword">using</span> <a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">IntroductionToAlgorithm::TreeAlgorithm::BinaryTreeNode</a>;</div>
<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;</div>
<div class="line"><a name="l00029"></a><span class="lineno"><a class="line" href="class_binary_tree_node_test.html">   29</a></span>&#160;<span class="keyword">class </span><a class="code" href="class_binary_tree_node_test.html">BinaryTreeNodeTest</a>:<span class="keyword">public</span> ::testing::Test</div>
<div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;{</div>
<div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;<span class="keyword">public</span>:</div>
<div class="line"><a name="l00032"></a><span class="lineno"><a class="line" href="class_binary_tree_node_test.html#aa8508b87ef3554a5dd1069a460f38679">   32</a></span>&#160;    <span class="keyword">typedef</span> <a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">BinaryTreeNode&lt;int&gt;</a> <a class="code" href="class_binary_tree_node_test.html#aa8508b87ef3554a5dd1069a460f38679">Node</a>;</div>
<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="keyword">protected</span>:</div>
<div class="line"><a name="l00034"></a><span class="lineno"><a class="line" href="class_binary_tree_node_test.html#a60ff0f181a5e3a45742949b1948b8095">   34</a></span>&#160;    <span class="keywordtype">void</span> <a class="code" href="class_binary_tree_node_test.html#a60ff0f181a5e3a45742949b1948b8095">SetUp</a>()</div>
<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;    {</div>
<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;        <a class="code" href="class_binary_tree_node_test.html#af2db7bcee955bff2d4d2aa815a09b329">default_node</a>=std::shared_ptr&lt;Node&gt;(<span class="keyword">new</span> <a class="code" href="class_binary_tree_node_test.html#aa8508b87ef3554a5dd1069a460f38679">Node</a>());</div>
<div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;        <a class="code" href="class_binary_tree_node_test.html#a07aad40489fc19ed29863c82a6c14863">root_node</a>=std::make_shared&lt;Node&gt;(0);</div>
<div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;        root_node-&gt;lchild=std::make_shared&lt;Node&gt;(1);</div>
<div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;        root_node-&gt;rchild=std::make_shared&lt;Node&gt;(2);</div>
<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;        root_node-&gt;lchild-&gt;parent=<a class="code" href="class_binary_tree_node_test.html#a07aad40489fc19ed29863c82a6c14863">root_node</a>;</div>
<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;        root_node-&gt;rchild-&gt;parent=<a class="code" href="class_binary_tree_node_test.html#a07aad40489fc19ed29863c82a6c14863">root_node</a>;</div>
<div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;    }</div>
<div class="line"><a name="l00043"></a><span class="lineno"><a class="line" href="class_binary_tree_node_test.html#a93cbc74d7d46635510578aefa62ceca5">   43</a></span>&#160;    <span class="keywordtype">void</span> <a class="code" href="class_binary_tree_node_test.html#a93cbc74d7d46635510578aefa62ceca5">TearDown</a>()</div>
<div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;    {}</div>
<div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;</div>
<div class="line"><a name="l00046"></a><span class="lineno"><a class="line" href="class_binary_tree_node_test.html#af2db7bcee955bff2d4d2aa815a09b329">   46</a></span>&#160;    std::shared_ptr&lt;Node&gt; <a class="code" href="class_binary_tree_node_test.html#af2db7bcee955bff2d4d2aa815a09b329">default_node</a>; </div>
<div class="line"><a name="l00047"></a><span class="lineno"><a class="line" href="class_binary_tree_node_test.html#a07aad40489fc19ed29863c82a6c14863">   47</a></span>&#160;    std::shared_ptr&lt;Node&gt; <a class="code" href="class_binary_tree_node_test.html#a07aad40489fc19ed29863c82a6c14863">root_node</a>;    </div>
<div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;};</div>
<div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;</div>
<div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;</div>
<div class="line"><a name="l00055"></a><span class="lineno"><a class="line" href="binarytreenode__test_8h.html#a5e60721fa0b0b3e063e4deeb6d6adde4">   55</a></span>&#160;<a class="code" href="binarytreenode__test_8h.html#a5e60721fa0b0b3e063e4deeb6d6adde4">TEST_F</a>(<a class="code" href="class_binary_tree_node_test.html">BinaryTreeNodeTest</a>, test_default_node)</div>
<div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;{</div>
<div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;    EXPECT_EQ(default_node-&gt;key,0);</div>
<div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;    EXPECT_FALSE(default_node-&gt;lchild); <span class="comment">//shared_ptr&lt;T&gt; 直接代表真假</span></div>
<div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;    EXPECT_EQ(default_node-&gt;rchild.get(),<span class="keyword">nullptr</span>); <span class="comment">//也可以抽取其指针</span></div>
<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;    EXPECT_FALSE(default_node-&gt;parent.lock());  <span class="comment">//weak_ptr&lt;T&gt; 必须通过lock()获取一个shared_ptr&lt;T&gt;</span></div>
<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;}</div>
<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;</div>
<div class="line"><a name="l00067"></a><span class="lineno"><a class="line" href="binarytreenode__test_8h.html#a47c27eb6ebf09ff66a60171c8595d2be">   67</a></span>&#160;<a class="code" href="binarytreenode__test_8h.html#a5e60721fa0b0b3e063e4deeb6d6adde4">TEST_F</a>(<a class="code" href="class_binary_tree_node_test.html">BinaryTreeNodeTest</a>, test_to_string)</div>
<div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;{</div>
<div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;    EXPECT_EQ(default_node-&gt;to_string(),<span class="stringliteral">&quot;node:0\n\t parent:null_ptr\n\t left_child:nullptr\n\t right_child:nullptr&quot;</span>);</div>
<div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;    EXPECT_EQ(root_node-&gt;to_string(),<span class="stringliteral">&quot;node:0\n\t parent:null_ptr\n\t left_child:1\n\t right_child:2&quot;</span>);</div>
<div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;}</div>
<div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;</div>
<div class="line"><a name="l00077"></a><span class="lineno"><a class="line" href="binarytreenode__test_8h.html#ab52f5722d4b86ec248400222aca3088b">   77</a></span>&#160;<a class="code" href="binarytreenode__test_8h.html#a5e60721fa0b0b3e063e4deeb6d6adde4">TEST_F</a>(<a class="code" href="class_binary_tree_node_test.html">BinaryTreeNodeTest</a>, test_to_xml)</div>
<div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;{</div>
<div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;    EXPECT_NE(default_node-&gt;to_xml(),<span class="stringliteral">&quot;&quot;</span>);</div>
<div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;    EXPECT_NE(root_node-&gt;to_xml(),<span class="stringliteral">&quot;&quot;</span>);</div>
<div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;}</div>
<div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;</div>
<div class="line"><a name="l00087"></a><span class="lineno"><a class="line" href="binarytreenode__test_8h.html#a28341da48ac03f4c9840714ab356c7c9">   87</a></span>&#160;<a class="code" href="binarytreenode__test_8h.html#a5e60721fa0b0b3e063e4deeb6d6adde4">TEST_F</a>(<a class="code" href="class_binary_tree_node_test.html">BinaryTreeNodeTest</a>, test_is_left_child)</div>
<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;{</div>
<div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;    EXPECT_FALSE(default_node-&gt;is_left_child());</div>
<div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;    EXPECT_TRUE(root_node-&gt;lchild-&gt;is_left_child());</div>
<div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;    EXPECT_FALSE(root_node-&gt;rchild-&gt;is_left_child());</div>
<div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;}</div>
<div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;</div>
<div class="line"><a name="l00098"></a><span class="lineno"><a class="line" href="binarytreenode__test_8h.html#a521f0066be61aeadfe17bbf7dec7855f">   98</a></span>&#160;<a class="code" href="binarytreenode__test_8h.html#a5e60721fa0b0b3e063e4deeb6d6adde4">TEST_F</a>(<a class="code" href="class_binary_tree_node_test.html">BinaryTreeNodeTest</a>, test_is_right_child)</div>
<div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;{</div>
<div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;    EXPECT_FALSE(default_node-&gt;is_right_child());</div>
<div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;    EXPECT_FALSE(root_node-&gt;lchild-&gt;is_right_child());</div>
<div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;    EXPECT_TRUE(root_node-&gt;rchild-&gt;is_right_child());</div>
<div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;}</div>
<div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;<span class="preprocessor">#endif // BINARYTREENODE_TEST</span></div>
<div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;</div>
<div class="ttc" id="class_binary_tree_node_test_html_a93cbc74d7d46635510578aefa62ceca5"><div class="ttname"><a href="class_binary_tree_node_test.html#a93cbc74d7d46635510578aefa62ceca5">BinaryTreeNodeTest::TearDown</a></div><div class="ttdeci">void TearDown()</div><div class="ttdef"><b>Definition:</b> <a href="binarytreenode__test_8h_source.html#l00043">binarytreenode_test.h:43</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node_html"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">IntroductionToAlgorithm::TreeAlgorithm::BinaryTreeNode</a></div><div class="ttdoc">BinaryTreeNode：二叉树的节点，算法导论xx章xx节 </div><div class="ttdef"><b>Definition:</b> <a href="binarytreenode_8h_source.html#l00031">binarytreenode.h:31</a></div></div>
<div class="ttc" id="binarytreenode_8h_html"><div class="ttname"><a href="binarytreenode_8h.html">binarytreenode.h</a></div></div>
<div class="ttc" id="binarytreenode__test_8h_html_a5e60721fa0b0b3e063e4deeb6d6adde4"><div class="ttname"><a href="binarytreenode__test_8h.html#a5e60721fa0b0b3e063e4deeb6d6adde4">TEST_F</a></div><div class="ttdeci">TEST_F(BinaryTreeNodeTest, test_default_node)</div><div class="ttdoc">binary_tree_node_test：测试二叉树节点 </div><div class="ttdef"><b>Definition:</b> <a href="binarytreenode__test_8h_source.html#l00055">binarytreenode_test.h:55</a></div></div>
<div class="ttc" id="class_binary_tree_node_test_html_a60ff0f181a5e3a45742949b1948b8095"><div class="ttname"><a href="class_binary_tree_node_test.html#a60ff0f181a5e3a45742949b1948b8095">BinaryTreeNodeTest::SetUp</a></div><div class="ttdeci">void SetUp()</div><div class="ttdef"><b>Definition:</b> <a href="binarytreenode__test_8h_source.html#l00034">binarytreenode_test.h:34</a></div></div>
<div class="ttc" id="class_binary_tree_node_test_html"><div class="ttname"><a href="class_binary_tree_node_test.html">BinaryTreeNodeTest</a></div><div class="ttdoc">BinaryTreeNodeTest:测试类，用于为测试提供基础数据 </div><div class="ttdef"><b>Definition:</b> <a href="binarytreenode__test_8h_source.html#l00029">binarytreenode_test.h:29</a></div></div>
<div class="ttc" id="class_binary_tree_node_test_html_a07aad40489fc19ed29863c82a6c14863"><div class="ttname"><a href="class_binary_tree_node_test.html#a07aad40489fc19ed29863c82a6c14863">BinaryTreeNodeTest::root_node</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; root_node</div><div class="ttdef"><b>Definition:</b> <a href="binarytreenode__test_8h_source.html#l00047">binarytreenode_test.h:47</a></div></div>
<div class="ttc" id="class_binary_tree_node_test_html_af2db7bcee955bff2d4d2aa815a09b329"><div class="ttname"><a href="class_binary_tree_node_test.html#af2db7bcee955bff2d4d2aa815a09b329">BinaryTreeNodeTest::default_node</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; default_node</div><div class="ttdef"><b>Definition:</b> <a href="binarytreenode__test_8h_source.html#l00046">binarytreenode_test.h:46</a></div></div>
<div class="ttc" id="class_binary_tree_node_test_html_aa8508b87ef3554a5dd1069a460f38679"><div class="ttname"><a href="class_binary_tree_node_test.html#aa8508b87ef3554a5dd1069a460f38679">BinaryTreeNodeTest::Node</a></div><div class="ttdeci">BinaryTreeNode&lt; int &gt; Node</div><div class="ttdef"><b>Definition:</b> <a href="binarytreenode__test_8h_source.html#l00032">binarytreenode_test.h:32</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="dir_8ed9dba4cd616b67da9b1338594e34e0.html">src</a></li><li class="navelem"><a class="el" href="dir_2a06141a7764b24a0bfc3200068bd811.html">tree_algorithms</a></li><li class="navelem"><a class="el" href="dir_1ca586a118e1b1bd1c74ce574da9dceb.html">binarytreenode</a></li><li class="navelem"><a class="el" href="binarytreenode__test_8h.html">binarytreenode_test.h</a></li>
    <li class="footer">Generated by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.10 </li>
  </ul>
</div>
</body>
</html>
